Constructive non-commutative rank computation is in deterministic polynomial time
نویسندگان
چکیده
منابع مشابه
A deterministic polynomial time algorithm for non-commutative rational identity testing with applications
In this paper we present a deterministic polynomial time algorithm for testing if a symbolic matrix in non-commuting variables over Q is invertible or not. The analogous question for commuting variables is the celebrated polynomial identity testing (PIT) for symbolic determinants. In contrast to the commutative case, which has an efficient probabilistic algorithm, the best previous algorithm fo...
متن کاملNon-commutative Polynomial Computations
In [6] Mora described an algorithm which, if it terminates, returns a noncommutative Gröbner basis. Here we follow that paper to prove the correctness of the algorithm as implemented by Dié Gijsbers and the author in GAP, cf. [1]. The algorithm is the core algorithm of the GAP package GBNP for computing with non-commutative polynomials. Earlier versions of this section were written with the hel...
متن کاملDeterministic polynomial-time test for prime ideals in a Dedekind domain with finite rank
We describe a deterministic polynomial-time test that determining whether a nonzero ideal is a prime ideal in a Dedekind domain with finite rank. The techniques which we used are basis representation of finite rings and the Hermite and Smith normal forms.
متن کاملProduct-type Non-commutative Polynomial States
In [Ans08a, Ans08b], we investigated monic multivariate non-commutative orthogonal polynomials, their recursions, states of orthogonality, and corresponding continued fraction expansions. In this note, we collect a number of examples, demonstrating what these general results look like for the most important states on non-commutative polynomials, namely for various product states. In particular,...
متن کاملAn arithmetic for non-size-increasing polynomial-time computation
An arithmetical system is presented with the property that from every proof a realizing term can be extracted that is definable in a certain affine linear typed variant of Gödel’s and therefore defines a non-size-increasing polynomial time computable function.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2018
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-018-0165-7